Ordered graphs and large bi-cliques in intersection graphs of curves
نویسندگان
چکیده
منابع مشابه
Large Cliques in Sparse Random Intersection Graphs
Given positive integers n and m, and a probability measure P on {0, 1, . . . ,m}, the random intersection graph G(n,m,P ) on vertex set V = {1, 2, . . . , n} and with attribute set W = {w1, w2, . . . , wm} is defined as follows. Let S1, S2, . . . , Sn be independent random subsets of W such that for any v ∈ V and any S ⊆ W we have P(Sv = S) = P (|S|)/ ( m |S| ) . The edge set of G(n,m,P ) consi...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملMaximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph). In particular, we consider the maximum clique problem for graphs with small intersection number and random intersection graphs (a model in which each one of m labels is chosen independently with probability p by each ...
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2019
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2019.07.005